Type Inference with Constrained Types

Subtyping Constrained Types

A constrained type is a type that comes with a set of subtyping constraints on variables occurring in the type. Constrained type inference systems are a natural generalization of Hindley/Milner type inference to languages with subtyping. This paper develops several subtyping relations on polymorphic constrained types of a general form that allows recursive constraints and multiple bounds on typ...

Constrained Types and their

A constrained type consists of both a standard type and a constraint set. Such types enable ee-cient type inference for object-oriented languages with polymorphism and subtyping, as demonstrated by Eifrig, Smith, and Trifonov. Until now, it has been unclear how expressive constrained types are. In this paper we study constrained types without universal quantiication. We prove that they accept t...

Subtyping Constrained Types ( Draft ) Valery Trifonov

Constrained type systems are a natural generalization of Hindley/Milner type inference to languages with subtyping. This paper develops several subtyping relations on constrained types. We establish a full type abstraction property that equates an operational notion of subtyping with a semantic notion based on regular trees. The decidability of this notion of subtyping is open; we present a dec...

Type Inference and Simpliication for Recursively Constrained Types

Type Inference for Recursively Constrained Types and

Type inference for recursively constrained types and its application to OOP

We de ne a powerful type inference mechanism with application to object oriented programming The types inferred are recursively constrained types types that come with a system of constraints These types may be viewed as generalizations of recur sive types and F bounded polymorphic types the forms of type that are necessary to properly encode object typings The base language we study I Soop inco...